INCIDENCE-GEOMETRIC ASPECTS OF FINITE ABELIAN GROUPSFAIGLE U.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 65; PP. 161-170; BIBL. 13 REF.Article

On ordered languages and the optimization of linear functions by Greedy algorithmsFAIGLE, U.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 4, pp 861-870, issn 0004-5411Article

Approximate core allocation for binpacking gamesFAIGLE, U; KERN, W.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 3, pp 387-399, issn 0895-4801Article

Note on the convergence of simulated annealing algorithmsFAIGLE, U; KERN, W.SIAM journal on control and optimization. 1991, Vol 29, Num 1, pp 153-159, issn 0363-0129Article

A combinatorial bijection between linear extensions of equivalent ordersFAIGLE, U; SCHRADER, R.Discrete mathematics. 1986, Vol 58, Num 3, pp 295-301, issn 0012-365XArticle

Note on scheduling intervals on-lineFAIGLE, U; NAWIJN, W. M.Discrete applied mathematics. 1995, Vol 58, Num 1, pp 13-17, issn 0166-218XArticle

A cutting-plane approach to the edge-weighted maximal clique problemDIJKHUIZEN, G; FAIGLE, U.European journal of operational research. 1993, Vol 69, Num 1, pp 121-130, issn 0377-2217Article

On the convergence of stationary distributions in simulated annealing algorithmsFAIGLE, U; SCHRADER, R.Information processing letters. 1988, Vol 27, Num 4, pp 189-194, issn 0020-0190Article

On the core of ordered submodular cost gamesFAIGLE, U; KERN, W.Mathematical programming. 2000, Vol 87, Num 3, pp 483-499, issn 0025-5610Article

Submodular linear programs on forestsFAIGLE, U; KERN, W.Mathematical programming. 1996, Vol 72, Num 2, pp 195-206, issn 0025-5610Article

A greedy reduction algorithm for setup optimizationFAIGLE, U; SCHRADER, R.Discrete applied mathematics. 1992, Vol 35, Num 1, pp 73-79, issn 0166-218XArticle

Orders and graphsFAIGLE, U; SCHRADER, R.Computing. Supplementum (Wien). 1990, Num 7, pp 109-124, issn 0344-8029, 16 p.Article

A size-width inequality for distributive latticesFAIGLE, U; SANDS, B.Combinatorica (Print). 1986, Vol 6, Num 1, pp 29-33, issn 0209-9683Article

Some order dimension bounds for communication complexity problemsFAIGLE, U; KERN, W.Acta informatica. 1991, Vol 28, Num 6, pp 593-601, issn 0001-5903Article

Sorting and recognition problems for ordered setsFAIGLE, U; TURAN, G.SIAM journal on computing (Print). 1988, Vol 17, Num 1, pp 100-113, issn 0097-5397Article

A setup heuristic for interval ordersFAIGLE, U; SCHRADER, R.Operations research letters. 1985, Vol 4, Num 4, pp 185-188, issn 0167-6377Article

An efficient algorithm for the three-guard problemXUEHOU TAN.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3312-3324, issn 0166-218X, 13 p.Conference Paper

N-extendible posets, and how to minimize total weighted completion timePETER, M; WAMBACH, G.Discrete applied mathematics. 2000, Vol 99, Num 1-3, pp 157-167, issn 0166-218XConference Paper

On some infinite series of (r, 1)-designsGROPP, H.Discrete applied mathematics. 2000, Vol 99, Num 1-3, pp 13-21, issn 0166-218XConference Paper

Randomized online algorithms for maximizing busy time interval schedulingFAIGLE, U; GARBE, R; KERN, W et al.Computing (Wien. Print). 1996, Vol 56, Num 2, pp 95-104, issn 0010-485XArticle

Algorithmic approaches to setup minimizationFAIGLE, U; GIERZ, G; SCHRADER, R et al.SIAM journal on computing (Print). 1985, Vol 14, Num 4, pp 954-965, issn 0097-5397Article

Cologne/Twente Workshop on Graphs and Combinatorial Optimization. CTW 2005FAIGLE, U; RANDERATH, B; SCHRADER, R et al.Discrete applied mathematics. 2008, Vol 156, Num 17, issn 0166-218X, 187 p.Conference Proceedings

Efficiency in exponential time for domination-type problemsSCHIERMEYER, Ingo.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3291-3297, issn 0166-218X, 7 p.Conference Paper

Page / 3